A Novel Dynamic Programming Approach to the Train Marshalling Problem
نویسندگان
چکیده
منابع مشابه
The train marshalling problem
The problem considered in this paper arose in connection with the rearrangement of railroad cars in China. In terms of sequences the problem reads as follows: contains all the elements of S p(1) , then all elements of S p(2) , : : :, etc., and nally all elements of S p(t). The aim of this paper is to show that the decision problem: \Given numbers n; k and a partition S of f1; 2; :::; ng, is K (...
متن کاملA Dynamic Programming Approach to the Aircraft Sequencing Problem
In this report, a number of Dynamic Programming algorithms for three versions of the Aircraft Sequencing problem are developed. In these, two alternative objectives are considered: How to land all of a prescribed set of airplanes as soon as possible, or alternatively, how t6minimize the total passenger waiting time. All these three versions are "static", namely, no intermediate aircraft arrival...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولA Multi-Heuristic Approach for Solving the Pre-Marshalling Problem
Minimizing the number of reshuffling operations at maritime container terminals incorporates the Pre-Marshalling Problem (PMP) as an important problem. Based on an analysis of existing solution approaches we develop new heuristics utilizing specific properties of problem instances of the PMP. We show that the heuristic performance is highly dependent on these properties. We introduce a new meth...
متن کاملFGP approach to multi objective quadratic fractional programming problem
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Intelligent Transportation Systems
سال: 2020
ISSN: 1524-9050,1558-0016
DOI: 10.1109/tits.2019.2898476